Double Structured Nuclear Norm-Based Matrix Decomposition for Saliency Detection
نویسندگان
چکیده
منابع مشابه
Feature Decomposition Based Saliency Detection in Electron Cryo-Tomograms
Electron Cryo-Tomography (ECT) allows 3D visualization of subcellular structures at the submolecular resolution in close to the native state. However, due to the high degree of structural complexity and imaging limits, the automatic segmentation of cellular components from ECT images is very difficult. To complement and speed up existing segmentation methods, it is desirable to develop a generi...
متن کاملCompressed-Sampling-Based Image Saliency Detection in the Wavelet Domain
When watching natural scenes, an overwhelming amount of information is delivered to the Human Visual System (HVS). The optic nerve is estimated to receive around 108 bits of information a second. This large amount of information can’t be processed right away through our neural system. Visual attention mechanism enables HVS to spend neural resources efficiently, only on the selected parts of the...
متن کاملOn Parlett's matrix norm inequality for the Cholesky decomposition
Dedicated to our friends Beresford and Velvel on the occasion of their sixtieth birthdays. ABSTRACT We show that a certain matrix norm ratio studied by Parlett has a supremum that is O(p n) when the chosen norm is the Frobenius norm, while it is O(log n) for the 2-norm. This ratio arises in Parlett's analysis of the Cholesky decomposition of an n by n matrix.
متن کاملOnline Matrix Completion Through Nuclear Norm Regularisation
It is the main goal of this paper to propose a novel method to perform matrix completion on-line. Motivated by a wide variety of applications, ranging from the design of recommender systems to sensor network localization through seismic data reconstruction, we consider the matrix completion problem when entries of the matrix of interest are observed gradually. Precisely, we place ourselves in t...
متن کاملLow-Rank Matrix Completion using Nuclear Norm
5 Minimization of the nuclear norm is often used as a surrogate, convex relaxation, for finding 6 the minimum rank completion (recovery) of a partial matrix. The minimum nuclear norm 7 problem can be solved as a trace minimization semidefinite programming problem (SDP ). 8 The SDP and its dual are regular in the sense that they both satisfy strict feasibility. Interior 9 point algorithms are th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3020966